Tracking Dynamic Water-borne Outbreaks with Temporal Consistency Constraints
نویسندگان
چکیده
منابع مشابه
Tracking Dynamic Water-borne Outbreaks with Temporal Consistency Constraints
Objective We describe a novel graph-based event detection approach which can accurately identify and track dynamic outbreaks (where the affected region changes over time). Our approach enforces soft constraints on temporal consistency, allowing detected regions to grow, shrink, or move while penalizing implausible region dynamics. Using simulated contaminant plumes diffusing through a water dis...
متن کاملMaintaining Global Consistency of Temporal Constraints in a Dynamic Environment
Computational problems from many different application areas can be seen as constraint satisfaction problems (CSPs). For example, the problems of scheduling a collection of tasks, or interpreting a visual image, or laying out a silicon chip, can all be seen in this way. Solving a CSP consists of finding an assignment of values to variables such that all the constraints are satisfied. If such as...
متن کاملEvaluating Consistency Algorithms for Temporal Metric Constraints
We study the performance of some known algorithms for solving the Simple Temporal Problem (STP) and the Temporal Constraint Satisfaction Problem (TCSP). In particular, we empirically compare the Bellman-Ford (BF) algorithm and its incremental version (incBF) by (Cesta & Oddi 1996) to the 4STP of (Xu & Choueiry 2003a). Among the tested algorithms, we show that 4STP is the most efficient for dete...
متن کاملIncremental Consistency Checking of Dynamic Constraints
Software design models are routinely adapted to domains, companies, and applications. This requires customizable consistency checkers that allow engineers to dynamically adapt model constraints. To benefit from quick design feedback, such consistency checkers should evaluate the consistency of such changeable constraints incrementally with design changes. This paper presents such a freely custo...
متن کاملMaintaining Consistency of Dynamic Cardinality Constraints with Costs
This paper introduce a novel method for maintaining consistency of cardinality constraints in context of dynamic constraint satisfaction. The presented method adopt sensitivity analysis for feasible and minimum cost flows underlying all cardinality constraints. Moreover, we extend a dynamic all-pairs shortest path algorithm to support weight changes, insertion and deletion of multiple edges and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Online Journal of Public Health Informatics
سال: 2013
ISSN: 1947-2579
DOI: 10.5210/ojphi.v5i1.4549